All superlinear inverse schemes are coNP-hard
نویسندگان
چکیده
منابع مشابه
All Superlinear Inverse Schemes Are coNP-Hard
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds diagonalizations against certificates directly into a circuit.
متن کاملO ct 2 00 4 All Superlinear Inverse Schemes are coNP - Hard ∗
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds diagonalizations against certificates directly into a circuit.
متن کامل23 v 1 1 2 O ct 2 00 4 All Superlinear Inverse Schemes are coNP - Hard ∗
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds diagonalizations against certificates directly into a circuit.
متن کاملInverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete
In this paper we show that the Inverse problems of HAMILTONIAN CYCLE and 3D-MATCHING are coNP complete. This completes the study of inverse problems of the six natural NP-complete problems from [GJ79] and answers an open question from [Ch03]. We classify the inverse complexity of the natural verifier for HAMILTONIAN CYCLE and 3D-MATCHING by showing coNP-completeness of the corresponding inverse...
متن کاملAll Permutations Supersequence is coNP-complete
We prove that deciding whether a given input word contains as subsequence every possible permutation of integers {1, 2, . . . , n} is coNP-complete. The coNP-completeness holds even when given the guarantee that the input word contains as subsequences all of length n−1 sequences over the same set of integers. We also show NP-completeness of a related problem of Partially Non-crossing Perfect Ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.07.015